A Co-evolutionary Decomposition-based Chemical Reaction Algorithm for Bi-level Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
Orthogonal chemical reaction optimization algorithm for global numerical optimization problems
Chemical reaction optimization (CRO) is a newly proposed, easy to implement metaheuristic inspired by the phenomena between molecules in chemical reactions. However, CRO behaves like a random search to traverse the whole solution space, which could confine the algorithm’s search ability. The orthogonal experimental design (OED) method is a robust-design method that can obtain the best combinati...
متن کاملAn Improved Co-Evolution Genetic Algorithm for Combinatorial Optimization Problems
This paper presents an improved co-evolution genetic algorithm (ICGA), which uses the methodology of game theory to solve the mode deception and premature convergence problem. In ICGA, groups become different players in the game. Mutation operator is designed to simulate the situation in the evolutionary stable strategy. Information transfer mode is added to ICGA to provide greater decision-mak...
متن کاملA New Optimization Algorithm For Combinatorial Problems
Combinatorial optimization problems are those problems that have a finite set of possible solutions. The best way to solve a combinatorial optimization problem is to check all the feasible solutions in the search space. However, checking all the feasible solutions is not always possible, especially when the search space is large. Thus, many meta-heuristic algorithms have been devised and modifi...
متن کاملA Cross-Entropy Based Algorithm for Combinatorial Optimization Problems
Cross Entropy has been recently applied to combinatorial optimization problems with promising results. This paper proposes a new cross-entropy based algorithm for monotonic integer programming problems with knapsack-type constraints. We show how the metaheuristic method can be adapted to tackle constrained problems, provided that some basic mathematical properties are enforced. Furthermore, som...
متن کاملA Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems
This paper describes Patent Number U.S. 8,046,316 B2, titled “Cyclic Combinatorial Method and System”, issued by the US Patents and Trademarks Office on October 25, 2011. The patent is based on a combinatorial algorithm to solve cyclic optimization problems. First, the algorithm identifies cyclically distinct solutions of such problems by enumerating cyclically distinct combinations of the basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.08.167